Uniform labelled semilattices

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees

A random walk on a finite graph can be used to construct a uniform random spanning tree. We show how random walk techniques can be applied to the study of several properties of the uniform random spanning tree: the proportion of leaves, the distribution of degrees, and the diameter.

متن کامل

Congruence Lattices of Semilattices

The main result of this paper is that the class of congruence lattices of semilattices satisfies no nontrivial lattice identities. It is also shown that the class of subalgebra lattices of semilattices satisfies no nontrivial lattice identities. As a consequence it is shown that if 5^* is a semigroup variety all of whose congruence lattices satisfy some fixed nontrivial lattice identity, then a...

متن کامل

Semilattices of Breadth Three

A 1984 problem of S. Z. Ditor asks whether there exists a lattice of cardinality א2, with zero, in which every principal ideal is finite and every element has at most three lower covers. We prove that the existence of such a lattice follows from either one of two axioms that are known to be independent of ZFC, namely (1) Martin’s Axiom restricted to collections of א1 dense subsets in posets of ...

متن کامل

Trees as semilattices

We study semilattices whose diagrams are trees. First, we characterize them as semilattices whose convex subsemilattices form a convex geometry, or, equivalently, the closure induced by convex subsemilattices is antiexchange. Then we give lattice theoretic and two graph theoretic characterizations of atomistic semilattices with tree diagrams.

متن کامل

Coloring Of Meet-Semilattices

Given a commutative semigroup S with 0, where 0 is the unique singleton ideal, we associate a simple graph Γ(S), whose vertices are labeled with the nonzero elements in S. Two vertices in Γ(S) are adjacent if and only if the corresponding elements multiply to 0. The inverse problem, i.e., given an arbitrary simple graph, whether or not it can be associated to some commutative semigroup, has pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Australian Mathematical Society

سال: 1979

ISSN: 1446-7887,1446-8107

DOI: 10.1017/s1446788700012520